Ramsey Precompact Expansions of Homogeneous Directed Graphs
نویسندگان
چکیده
In 2005, Kechris, Pestov and Todorčević provided a powerful tool to compute an invariant of topological groups known as the universal minimal flow, immediately leading to an explicit representation of this invariant in many concrete cases. More recently, the framework was generalized allowing for further applications, and the purpose of this paper is to apply these new methods in the context of homogeneous directed graphs. In this paper, we show that the age of any homogeneous directed graph allows a Ramsey precompact expansion. Moreover, we verify the relative expansion properties and consequently describe the respective universal minimal flows.
منابع مشابه
Ramsey expansions of metrically homogeneous graphs
We discuss the Ramsey property, the existence of a stationary independence relation and the coherent extension property for partial isometries (coherent EPPA) for all classes of metrically homogeneous graphs from Cherlin’s catalogue, which is conjectured to include all such structures. We show that, with the exception of tree-like graphs, all metric spaces in the catalogue have precompact Ramse...
متن کاملA Ramsey theorem for countable homogeneous directed graphs
Let T be a ,nite set of ,nite tournaments and HT the countable homogeneous directed graph which does not embed any of the tournaments in T. We will completely describe the vertex partition property HT. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملCompleting graphs to metric spaces
We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions. This is extended variant of an extended abstract accepted to Eurocomb 2017 which contains proofs of the main statements.
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملUnary functions
We consider F , the class of nite unary functions, i.e. the class of pairs of the form (A; f) where A is a nite set and f is an unary function on A. We also consider two subclasses of F : B and Fk for k > 1. B contains structures (A; f) with the property that f is a bijection of the set A, and Fk contains structures (A; f) with the property that inverse image of every point in A under f has c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014